Deterministic Republic

Varinace-Based Sensitivity Analysis of Deterministic Model

‎The study of many scientific and natural phenomena in laboratory condition is sometimes impossible‎, ‎therefore theire expresed by mathemathical models and simulated by complex computer models (codes)‎. ‎Running a computer model with different inputs is called a computer expriment‎. ‎Statistical issues allocated a wide range of applications for computer expriment to itself‎. ‎In this paper‎, ‎...

Deterministic vs Non-deterministic Graph Property Testing

A graph property P is said to be testable if one can check whether a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a “certificate” to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph propert...

Deterministic and Non-Deterministic Stable Models

Training Deterministic Parsers with Non-Deterministic Oracles

Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the sense that they assume a unique canonical path through the transition system and are only valid as long as the parser does not stray from this path. In this paper, we give a gener...

DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA

In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...